Fast Approximate PCPs for Multidimensional Bin-Packing Problems
نویسندگان
چکیده
We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blocks can be packed into a small number of bins. The running time of the verifier is bounded by , where is the time required to test for heaviness. We give heaviness testers that can test heaviness of an element in the domain in time . We also also give approximate PCPs with efficient verifiers for recursive bin packing and multidimensional routing.
منابع مشابه
Fast approximate probabilistically checkable proofs
We investigate the question of when a verifier, with the aid of a proof, can reliably compute a function faster than it can without the proof. The proof system model that we use is based on a variant of the Probabilistically Checkable Proofs (PCP) model, in which a verifier can ascertain the correctness of the proof by looking at very few locations in the proof. However, known results in the PC...
متن کاملAn Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem
This paper describes a constrained bin-packing •problem (CBPP) and an approximate, anytime algor i thm for solutions. A CBPP is a constrained version of the bin-packing problem, in which a set of items allocated to a bin are ordered in a way to satisfy constraints defined on them and achieve near-optimality. The algor i thm for CBPP uses a heuristic search for labeling edges w i th a binary val...
متن کاملOverview of the Algorithms for Solving the Multidimensional Knapsack Problems
The multidimensional knapsack problem is defined as an optimization problem that is NP-hard combinatorial. The multidimensional knapsack problems have large applications, which include many applicable problems from different area, like cargo loading, cutting stock, bin-packing, financial and other management, etc. This paper reviews some researches published in the literature. The concentrate i...
متن کاملTSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems
We present a computer code that implements a general Tabu Search technique for the solution of two-and three-dimensional bin packing problems, as well as virtually any of their variants requiring the minimization of the number of bins. The user is only requested to provide a procedure that gives an approximate solution to the actual variant to be solved.
متن کاملOptimal Online Algorithms for Multidimensional Packing Problems
We solve an open problem in the literature by providing an online algorithm for multidimensional bin packing that uses only bounded space. To achieve this, we introduce a new technique for classifying the items to be packed. We show that our algorithm is optimal among bounded space algorithms for any dimension d > 1. Its asymptotic performance ratio is (Π∞) , where Π∞ ≈ 1.691 is the asymptotic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 196 شماره
صفحات -
تاریخ انتشار 1999